Asymptotically Optimal Lower Bounds for the Condition Number of a Real Vandermonde Matrix

نویسنده

  • Ren-Cang Li
چکیده

Lower bounds on the condition number minκp(V ) of a Vandermonde matrix V are established in terms of the dimension n or n and the largest absolute value among all nodes that define the Vandermonde matrix. Many bounds here are asymptotically sharp, and compare favorably to those of the same kind due to Gautschi and Inglese (Numer. Math., 52 (1988), 241–250) who considered either all positive nodes or real symmetric nodes and those due to Tyrtyshnikov (Numer. Math., 67 (1994), 261–269). As consequences our bounds imply that minκp(V ) over all possible real nodes goes to ∞ as fast as (1 + √ 2 )n, and minκp(V ) over all possible nonnegative nodes goes to ∞ as fast as (1 +√2 )2n. Extensions were made to confluent Vandermonde matrices and rectangular Vandermonde matrices, including brief outlines on how to deal with Vandermonde-like matrices and complex Vandermonde matrices. This report is available on the web at http://www.ms.uky.edu/∼math/MAreport/PDF/04-05.pdf. Department of Mathematics, University of Kentucky, Lexington, KY 40506 ([email protected].) This work was supported in part by the National Science Foundation CAREER award under Grant No. CCR9875201. Asymptotically Optimal Lower Bounds For the Condition Number of a Real Vandermonde Matrix Ren-Cang Li ∗ May 2004 Revised July 2004 Abstract Lower bounds on the condition number min κp(V ) of a Vandermonde matrix V are established in terms of the dimension n or n and the largest absolute value among all nodes that define the Vandermonde matrix. Many bounds here are asymptotically sharp, and compare favorably to those of the same kind due to Gautschi and Inglese (Numer. Math., 52 (1988), 241–250) who considered either all positive nodes or real symmetric nodes and those due to Tyrtyshnikov (Numer. Math., 67 (1994), 261–269). As consequences our bounds imply that min κp(V ) over all possible real nodes goes to ∞ as fast as (1 +√2 ), and min κp(V ) over all possible nonnegative nodes goes to ∞ as fast as (1 +√2 ). Extensions were made to confluent Vandermonde matrices and rectangular Vandermonde matrices, including brief outlines on how to deal with Vandermonde-like matrices and complex Vandermonde matrices.Lower bounds on the condition number min κp(V ) of a Vandermonde matrix V are established in terms of the dimension n or n and the largest absolute value among all nodes that define the Vandermonde matrix. Many bounds here are asymptotically sharp, and compare favorably to those of the same kind due to Gautschi and Inglese (Numer. Math., 52 (1988), 241–250) who considered either all positive nodes or real symmetric nodes and those due to Tyrtyshnikov (Numer. Math., 67 (1994), 261–269). As consequences our bounds imply that min κp(V ) over all possible real nodes goes to ∞ as fast as (1 +√2 ), and min κp(V ) over all possible nonnegative nodes goes to ∞ as fast as (1 +√2 ). Extensions were made to confluent Vandermonde matrices and rectangular Vandermonde matrices, including brief outlines on how to deal with Vandermonde-like matrices and complex Vandermonde matrices. ∗Department of Mathematics, University of Kentucky, Lexington, KY 40506 ([email protected].) Supported in part by the National Science Foundation CAREER award under Grant No. CCR-9875201.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vandermonde Matrices with Chebyshev Nodes

For n × n Vandermonde matrix Vn = (αi−1 j )1≤i j≤n with translated Chebyshev zero nodes, it is discovered that V T n admits an explicit QR decomposition with the R-factor consisting of the coefficients of the translated Chebyshev polynomials of degree less than n. This decomposition then leads to an exact expression for the condition number of its submatrix Vk,n = (αi−1 j )1≤i≤k,1≤j≤n (so-calle...

متن کامل

Lower bounds for the condition number of a real confluent Vandermonde matrix

Lower bounds on the condition number κp(Vc ) of a real confluent Vandermonde matrix Vc are established in terms of the dimension n or n and the largest absolute value among all nodes that define the confluent Vandermonde matrix or n and the interval that contains the nodes. In particular, it is proved that for any modest kmax (the largest number of equal nodes), κp(Vc ) behaves no smaller than ...

متن کامل

New Bases for Polynomial-Based Spaces

Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...

متن کامل

Superresolution, the Recovery of Missing Samples, and Vandermonde Matrices on the Unit Circle

The purpose of this paper is to study the conditioning of complex Vandermonde matrices, in reference to applications such as superresolution and the problem of recovering missing samples in band-limited signals. The results include bounds for the singular values of Vandermonde matrices whose nodes are complex numbers on the unit circle. It is shown that, under certain conditions, such matrices ...

متن کامل

2 Estimates in Terms of a Polynomial Extremal Problem

We show that the Euclidean condition number of any positive deenite Hankel matrix of order n 3 may be bounded from below by n?1 =(16n) with = exp(4Catalan==) 3:210, and that this bound may be improved at most by a factor 8n. Similar estimates are given for the class of real Vandermonde matrices, the class of row scaled real Vandermonde matrices, and the class of Krylov matrices with Hermitian a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • SIAM J. Matrix Analysis Applications

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2006